Weighted Constraint Iterative Algorithm for Phase Hologram Generation

An iterative approach for estimation of efficiency by weighted distance

Non-iterative phase hologram computation for low speckle holographic image projection.

Phase-only spatial light modulators (SLMs) are widely used in holographic display applications, including holographic image projection (HIP). Most phase computer generated hologram (CGH) calculation algorithms have an iterative structure with a high computational load, and also are prone to speckle noise, as a result of the random phase terms applied on the desired images to mitigate the encodi...

Applied Partial Constraint Satisfaction Using Weighted Iterative Repair

Many real-world constraint satisfaction problems (CSPs) can be over-constrained or too large to solve using a standard constructive/backtracking approach. Instead, faster heuristic techniques have been proposed that perform a partial search of all possible solutions using an iterative repair or hill-climbing approach. The main problem with such approaches is that they can become stuck in local ...

Properties of IsaCoSy’s Constraint Generation Algorithm

This report states and sketches the proofs for some important properties of IsaCoSy’s constraint generation algorithm. We claim that for any rewrite rule, the constraint generation algorithm produces constraints that will prohibit the synthesis of exactly the terms containing a redex which can be rewritten by that rule (and no others).

Iterative split-and-merge algorithm for VQ codebook generation

We propose a new iterative algorithm for the generation of a codebook in vector quantization. The algorithm starts with an initial codebook that is improved by a combination of merge and split operations. By merging small neighboring clusters, additional resources (codevectors) will be released. These extra codevectors can be reallocated by splitting large clusters. This process can be iterated...